Pareto Governors for Energy-Optimal Computing
نویسندگان
چکیده
منابع مشابه
Computing Pareto Optimal Committees
Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for desirability of a committee, Pareto optimality is a minimal and important requirement. As asking agents to specify their preferences over exponentially many subsets of alternatives is practically infeasible, we assume that each ag...
متن کاملComputing and Testing Pareto Optimal Committees
Selecting a set of alternatives based on the preferences of agents is an important problem in committee selection and beyond. Among the various criteria put forth for the desirability of a committee, Pareto optimality is a minimal and important requirement. As asking agents to specify their preferences over exponentially many subsets of alternatives is practically infeasible, we assume that eac...
متن کاملComputing Pareto Optimal Coordinations on Roadmaps
We consider coordination of multiple robots in a common environment, each robot having its own (distinct) roadmap. Our primary contribution is a classification of and exact algorithm for computing vector-valued — or Pareto — optima for collision-free coordination. We indicate the utility of new geometric techniques from CAT(0) geometry and give an argument that curvature bounds are the key dist...
متن کاملComputing optimal subsidies for Iranian renewable energy investments using real options
For the valuation of the renewable energy investments, providing private investors with a financial incentive to accelerate their investment is a very significant issue. Financial subsidies are known by the majority of the people to be one of the most important drivers in renewable energy expansion and one of the main reasons which result in the development of any industry. In this paper, we pr...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2017
ISSN: 1544-3566,1544-3973
DOI: 10.1145/3046682